Characteristic parsing: A framework for producing compact deterministic parsers, I
نویسندگان
چکیده
منابع مشابه
Training Deterministic Parsers with Non-Deterministic Oracles
Greedy transition-based parsers are very fast but tend to suffer from error propagation. This problem is aggravated by the fact that they are normally trained using oracles that are deterministic and incomplete in the sense that they assume a unique canonical path through the transition system and are only valid as long as the parser does not stray from this path. In this paper, we give a gener...
متن کاملDeterministic, Error-Correcting Combinator Parsers
We show how error-correcting, deterministic, combinator parsers can be constructed for grammars which have the LL(1) property. The normal disadvantages of conventional combinator parsers, such as their lack of speed and their poor error reporting, are remedied. Parsers constructed with these combinators are implicitly specialised for the grammar they describe. Because of this property the combi...
متن کاملDesign of A Compact CPW-FED UWB Antenna with WiMAX and WLAN Band-Notched Characteristic Evaluated in AHP Framework
In this article, we present a new design of a coplanar waveguide fed (CPW-fed) ultra-wideband (UWB) antenna with dual band-notched characteristics. Two notched frequency bands are achieved by using two inverted U-shaped stepped impedance resonators. The proposed antenna can operate from 2.82 to 11 GHz (118%), defined by VSWR< 2, except two notched bands around 3.5 GHz (WiMAX) and 5.5 GHz (WLAN)...
متن کاملHIT Dependency Parsing : Bootstrap Aggregating Heterogeneous Parsers
The paper describes our system of Shared Task on Parsing the Web. We only participate in dependency parsing task. A number of methods have been developed for dependency parsing. Each of the methods adopts very different view of dependency parsing, and each view can have its strengths and limitations. Thus system combination can have great potential to further improve the performance of dependen...
متن کاملUnsupervised Dependency Parsing: Let's Use Supervised Parsers
We present a self-training approach to unsupervised dependency parsing that reuses existing supervised and unsupervised parsing algorithms. Our approach, called ‘iterated reranking’ (IR), starts with dependency trees generated by an unsupervised parser, and iteratively improves these trees using the richer probability models used in supervised parsing that are in turn trained on these trees. Ou...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Computer and System Sciences
سال: 1977
ISSN: 0022-0000
DOI: 10.1016/s0022-0000(77)80017-2